Polyhedra with specified links
نویسندگان
چکیده
منابع مشابه
Numerical modeling of links behavior in eccentric bracings with dual vertical links
Configuration and geometry of bracing systems affect the seismic performance of structures significantly. Recently, the current authors have introduced a new configuration for eccentric bracing of structural frames that may be assumed as the combination of inverted Y-type and rotated K-type EBFs. The resulted braced frame is called EBF-DVL, consisting of two vertical links attached together by ...
متن کاملTiling Polyhedra with Tetrahedra
When solving an algorithmic problem involving a polyhedron in R, it is common to start by partitioning the given polyhedron into simplier ones. The most common process is called triangulation and it refers to partitioning a polyhedron into tetrahedra in a face-to-face manner. In this paper instead of triangulations we will consider tilings by tetrahedra. In a tiling the tetrahedra are not requi...
متن کاملBlending Polyhedra with Overlays
We introduce a novel method for constructing polyhedra by blending together two or more existing polyhedra, using a dualization method. The method results in a Minkowski sum, analogous to that of overlay tilings [5], which uses a topological dual operation to create tilings from a network (a graph embedded in a plane). This paper extends that method to networks on the surface of the unit sphere...
متن کاملWidening Polyhedra with Landmarks
The abstract domain of polyhedra is sufficiently expressive to be deployed in verification. One consequence of the richness of this domain is that long, possibly infinite, sequences of polyhedra can arise in the analysis of loops. Widening and narrowing have been proposed to infer a single polyhedron that summarises such a sequence of polyhedra. Motivated by precision losses encountered in veri...
متن کاملTemplate Polyhedra with a Twist
In this paper, we draw upon connections between bilinear programming and the process of computing (post) fixed points in abstract interpretation. It is well-known that the data flow constraints for numerical domains are expressed in terms of bilinear constraints. Algorithms such as policy and strategy iteration have been proposed for the special case of bilinear constraints that arise from temp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Séminaire de théorie spectrale et géométrie
سال: 2003
ISSN: 2118-9242
DOI: 10.5802/tsg.331